--- title: Weak Labeling for Semi-Supervised Learning ---

This notebook demonstrates how to use weak labeling for semi-supervised learning. We will explore different weak labeling techniques and evaluate their performance.

The weak labeling techniques we will explore are:

1. Logistic Regression
2. KNeighbors
3. Random Forest
4. Neural Network
5. Support Vector Machine

We will use the sentence-transformers library to generate sentence embeddings and the scikit-learn library to train the weak labeling models.

The weak labeling models will be trained on the labeled development set and will then be used to predict the labels of the unlabeled development set. We will then evaluate the performance of the weak labeling models on the validation set, which is also labeled.

Finally, we will save the best weak labeling models so that they can be used in the semi-supervised learning phase of the weak labeling together with the provided pipeline for inference.

Setup

import os
import pickle
import random
import sys

import numpy as np
import seaborn as sns
import torch
from dotenv import load_dotenv
from matplotlib import pyplot as plt
from sentence_transformers import SentenceTransformer
from sklearn.metrics import classification_report, confusion_matrix

current_dir = os.getcwd()
parent_dir = os.path.dirname(current_dir)

sys.path.append(parent_dir)

load_dotenv()

DATA_DIR = os.getenv('DATA_DIR', 'data')
MODELS_DIR = os.getenv('MODELS_DIR', 'models')

DATA_DIR = os.path.abspath(os.path.join(parent_dir, DATA_DIR))
MODELS_DIR = os.path.abspath(os.path.join(parent_dir, MODELS_DIR))

assert DATA_DIR is not None
assert MODELS_DIR is not None

SEED = 1337


def set_seed():
    torch.use_deterministic_algorithms(True)

    random.seed(SEED)
    np.random.seed(SEED)

    torch.manual_seed(SEED)
    if torch.cuda.is_available():
        torch.cuda.manual_seed(SEED)
        torch.cuda.manual_seed_all(SEED)

    torch.backends.cudnn.deterministic = True
    torch.backends.cudnn.benchmark = False


set_seed()

As the sentence-transformers gives us a torch model, we need to check the environment to see if we can use a suitable accelerator.

if torch.backends.mps.is_available():
    device = torch.device('mps')
elif torch.cuda.is_available():
    device = torch.device('cuda')
else:
    device = torch.device('cpu')

print('Device:', device)

Device: mps

Load Datasets

We will load the labeled development set, the unlabeled development set, and the validation set.

Here a short overview of the datasets:

• Train Dataset: Labeled development set
• Validation Dataset: Validation set
• Test Dataset: Unlabeled development set

The test dataset would not be available in a real-world scenario, but we will use it to get an idea of how well the weak labeling models perform on unseen data and thus make assumptions about the performance later on the downstream tasks.

from src.data_loader import load_datasets

partitions_dir = os.path.join(DATA_DIR, 'partitions')
labelled_dev, unlabelled_dev, val_set = load_datasets(partitions_dir)
train_df = labelled_dev
y_train = train_df['label']

val_df = val_set
y_val = val_df['label']

test_df = unlabelled_dev
y_test = test_df['ground_truth']

Sentence Embeddings

We will use the sentence-transformers library to generate sentence embeddings for the text data. The embedding models we will discuss are:

1. all-MiniLM-L6-v2: Fast and efficient model
2. all-mpnet-base-v2: High-quality model

All the models are pre-trained on a large corpus of text data and can generate high-quality sentence embeddings. The choice of the model depends on the trade-off between quality and efficiency. From the documentation:

The all-mpnet-base-v2 model provides the best quality, while all-MiniLM-L6-v2 is 5 times faster and still offers good quality.

In the next section, we will compare the impact on performance of the weak labeling models when using the two different embedding models and ultimately make a decision on which model to use.

def get_sentence_transformer_model(model_name, device=device):
    return SentenceTransformer(model_name).to(device)


EMBEDDING_MODELS = {
    'mini_lm': get_sentence_transformer_model("all-MiniLM-L6-v2"),
    'mpnet_base': get_sentence_transformer_model("all-mpnet-base-v2")
}

/Users/noah/dev/bsc/npr-mc2/venv/lib/python3.11/site-packages/huggingface_hub/file_download.py:1132: FutureWarning: `resume_download` is deprecated and will be removed in version 1.0.0. Downloads always resume when possible. If you want to force a new download, use `force_download=True`.
  warnings.warn(
/Users/noah/dev/bsc/npr-mc2/venv/lib/python3.11/site-packages/huggingface_hub/file_download.py:1132: FutureWarning: `resume_download` is deprecated and will be removed in version 1.0.0. Downloads always resume when possible. If you want to force a new download, use `force_download=True`.
  warnings.warn(

The functions below will be used to generate and save the sentence embeddings for the text data using the sentence-transformers model. The embeddings will be generated for the labeled development set, the unlabeled development set, and the validation set. The embeddings will be saved to disk so that they can be loaded later without having to regenerate them.

If the embeddings are already generated and saved to disk, the functions will load the embeddings from disk instead of regenerating them.

import time

EMBEDDINGS_FOLDER = os.path.join(DATA_DIR, 'embeddings')
os.makedirs(EMBEDDINGS_FOLDER, exist_ok=True)


def load_embeddings(filename):
    """Load the embeddings from disk."""
    with open(f'{EMBEDDINGS_FOLDER}/{filename}.pkl', 'rb') as f:
        embeddings = pickle.load(f)
    return embeddings


def generate_embeddings(model, texts, verbose=True):
    """Generate sentence embeddings using the sentence-transformers model."""
    embeddings = model.encode(texts, show_progress_bar=verbose)
    return embeddings


def save_embeddings(embeddings, filename):
    """Save the embeddings to disk."""
    with open(f'{EMBEDDINGS_FOLDER}/{filename}.pkl', 'wb') as f:
        pickle.dump(embeddings, f)


def generate_and_save_embeddings(model, texts, filename):
    """Generate and save the embeddings."""
    if os.path.exists(f'{EMBEDDINGS_FOLDER}/{filename}.pkl'):
        embeddings = load_embeddings(filename)
        return embeddings

    embeddings = generate_embeddings(model, texts)
    save_embeddings(embeddings, filename)
    return embeddings


EMBEDDING_MODEL_DATA = {}
for model_name, model in EMBEDDING_MODELS.items():
    print(f'Generating embeddings for {model_name}')

    start = time.time()

    # Mappings back to partitioning keys:
    # train -> labelled development set, 
    # val -> validation set
    # test -> unlabelled development set
    X_train = generate_and_save_embeddings(model, train_df['content'].values,
                                           f'{model_name}/labelled_dev')
    X_val = generate_and_save_embeddings(model, val_df['content'].values,
                                         f'{model_name}/validation_set')
    X_test = generate_and_save_embeddings(model, test_df['content'].values,
                                          f'{model_name}/unlabelled_dev')

    end = time.time()

    print(f'Generated embeddings for {model_name} in {end - start:.2f} seconds')
    print(
        f'Train Embeddings Shape: {X_train.shape}, Validation Embeddings Shape: {X_val.shape}, Test Embeddings Shape: {X_test.shape}')

    EMBEDDING_MODEL_DATA[model_name] = {
        'X_train': X_train,
        'X_val': X_val,
        'X_test': X_test
    }

Generating embeddings for mini_lm
Generated embeddings for mini_lm in 0.00 seconds
Train Embeddings Shape: (1000, 384), Validation Embeddings Shape: (666, 384), Test Embeddings Shape: (5000, 384)
Generating embeddings for mpnet_base
Generated embeddings for mpnet_base in 0.00 seconds
Train Embeddings Shape: (1000, 768), Validation Embeddings Shape: (666, 768), Test Embeddings Shape: (5000, 768)

As expected the larger model all-mpnet-base-v2 takes more time to generate the embeddings compared to the smaller model all-MiniLM-L6-v2. The dimensions of the embeddings also differ, with the larger model generating embeddings of size 768 and the smaller model generating embeddings of size 384.

Evaluation Function

We will use the following function to evaluate the performance of the weak labeling models on the validation and test sets. It will print the classification report and confusion matrix for the predictions made by the weak labeling models.

The test set would not be available in a real-world scenario, but we will use it to get an idea of how well the weak labeling models perform on unseen data and thus make assumptions about the performance later on the downstream task. This obviously introduces some bias for the decision-making process, but we will use it for the sake of the demonstration.

def print_evaluation(y_true, y_pred, title, plot_cm=False):
    """Prints the evaluation metrics for a classification model."""
    print(f'\nClassification Report: {title}')
    print(classification_report(y_true, y_pred))

    if plot_cm:
        cm = confusion_matrix(y_true, y_pred)
        sns.heatmap(cm, annot=True, fmt='d', cmap='Blues')
        plt.title(f'Confusion Matrix: {title}')
        plt.xlabel('Predicted')
        plt.ylabel('True')
        plt.show()

Comparison between Embedding Models

We discovered in the process of working on the comparison of weak labelling approaches, that the difference in the embeddings generated by the two models significantly affects the performance of the weak labeling models. For this reason, we will compare the performance of the weak labeling models trained on the embeddings generated by the two models to get an idea of which model performs better. We will make a decision afterwards on which model to use for all the subsequent approaches discussed. This as the computational cost would otherwise be excessive also considering the downstream tasks of fine-tuning and transfer learning for both embedding models used to generate weak labels.

We will use a simple Logistic Regression model for this comparison. As this is a baseline comparison, we will not perform hyperparameter tuning for the Logistic Regression model.

from sklearn.linear_model import LogisticRegression

for model_name, model_data in EMBEDDING_MODEL_DATA.items():
    X_train = model_data['X_train']
    X_val = model_data['X_val']
    X_test = model_data['X_test']

    log_reg = LogisticRegression(max_iter=100_000)
    log_reg.fit(X_train, y_train)

    print_evaluation(y_val, log_reg.predict(X_val),
                     f'Logistic Regression (model={model_name}, set=Validation Set)')

    print_evaluation(y_test, log_reg.predict(X_test),
                     f'Logistic Regression (model={model_name}, set=Test Set)')

Classification Report: Logistic Regression (model=mini_lm, set=Validation Set)
              precision    recall  f1-score   support

           0       0.80      0.79      0.79       333
           1       0.79      0.80      0.80       333

    accuracy                           0.80       666
   macro avg       0.80      0.80      0.80       666
weighted avg       0.80      0.80      0.80       666


Classification Report: Logistic Regression (model=mini_lm, set=Test Set)
              precision    recall  f1-score   support

           0       0.80      0.78      0.79      2500
           1       0.79      0.80      0.80      2500

    accuracy                           0.79      5000
   macro avg       0.79      0.79      0.79      5000
weighted avg       0.79      0.79      0.79      5000


Classification Report: Logistic Regression (model=mpnet_base, set=Validation Set)
              precision    recall  f1-score   support

           0       0.85      0.86      0.86       333
           1       0.86      0.85      0.86       333

    accuracy                           0.86       666
   macro avg       0.86      0.86      0.86       666
weighted avg       0.86      0.86      0.86       666


Classification Report: Logistic Regression (model=mpnet_base, set=Test Set)
              precision    recall  f1-score   support

           0       0.87      0.85      0.86      2500
           1       0.85      0.87      0.86      2500

    accuracy                           0.86      5000
   macro avg       0.86      0.86      0.86      5000
weighted avg       0.86      0.86      0.86      5000

We can see that for this baseline comparison the all-mpnet-base-v2 model performs better than the all-MiniLM-L6-v2 model with a considerable margin of roughly 0.06% in F1-score on both the validation and test sets.

As the all-mpnet-base-v2 model performs better than the all-MiniLM-L6-v2 model, we will use the embeddings generated by the all-mpnet-base-v2 model for the subsequent steps although the dimensionality of the embeddings is higher. This could result in higher computational costs but give the observed margin in performance this seems justified.

# set X_train, X_val, X_test to the embeddings of the best model for subsequent steps
X_train = EMBEDDING_MODEL_DATA['mpnet_base']['X_train']
y_train = train_df['label']

X_val = EMBEDDING_MODEL_DATA['mpnet_base']['X_val']
y_val = val_df['label']

X_test = EMBEDDING_MODEL_DATA['mpnet_base']['X_test']
y_test = test_df['ground_truth']

print(f'X_train Shape: {X_train.shape}, y_train Shape: {y_train.shape}')
print(f'X_val Shape: {X_val.shape}, y_val Shape: {y_val.shape}')
print(f'X_test Shape: {X_test.shape}, y_test Shape: {y_test.shape}')

X_train Shape: (1000, 768), y_train Shape: (1000,)
X_val Shape: (666, 768), y_val Shape: (666,)
X_test Shape: (5000, 768), y_test Shape: (5000,)

Approach 1: Logistic Regression

Logistic Regression is selected as the first approach due to its simplicity and interpretability, making it an ideal baseline for weak labeling tasks. It is a well-understood algorithm that provides clear insights into the relationship between features and the target variable. Despite its simplicity, Logistic Regression is effective for binary classification tasks, such as the one in this challenge. It serves as a solid starting point to evaluate the performance of weak labeling before exploring more complex models.

We will use grid search to find the best hyperparameters for the logistic regression model as we will do for all the other subsequent approaches discussed in this notebook.

from sklearn.model_selection import GridSearchCV

log_reg_param_grid = {
    'C': [0.001, 0.01, 0.1, 1, 3, 5, 10, 100],
    'max_iter': [100_000]
}

log_reg_grid_search = GridSearchCV(LogisticRegression(random_state=SEED),
                                   log_reg_param_grid,
                                   n_jobs=-1,
                                   cv=5,
                                   verbose=3)
log_reg_grid_search.fit(X_train, y_train)

log_reg_model = log_reg_grid_search.best_estimator_
print(f'Best Parameters: {log_reg_grid_search.best_params_}')

print_evaluation(y_val, log_reg_model.predict(X_val),
                 'Logistic Regression (Validation Set)')

print_evaluation(y_test, log_reg_model.predict(X_test),
                 'Logistic Regression (Test Set)')

Fitting 5 folds for each of 8 candidates, totalling 40 fits
Best Parameters: {'C': 5, 'max_iter': 100000}

Classification Report: Logistic Regression (Validation Set)
              precision    recall  f1-score   support

           0       0.86      0.86      0.86       333
           1       0.86      0.86      0.86       333

    accuracy                           0.86       666
   macro avg       0.86      0.86      0.86       666
weighted avg       0.86      0.86      0.86       666


Classification Report: Logistic Regression (Test Set)
              precision    recall  f1-score   support

           0       0.87      0.85      0.86      2500
           1       0.85      0.87      0.86      2500

    accuracy                           0.86      5000
   macro avg       0.86      0.86      0.86      5000
weighted avg       0.86      0.86      0.86      5000

• Balanced Performance: The model shows consistent precision, recall, and F1-score of 0.86 across both classes, indicating it can accurately classify both positive and negative instances without bias.
• High Reliability: An accuracy of 0.86 reflects the model's strong ability to make correct predictions, making it a dependable choice for weak labeling tasks.
• Good Generalization: The similar performance on both validation and test sets suggests the model generalizes well to new, unseen data.

Approach 2: KNeighbors Weak Labeling

The KNeighbors classifier is chosen for its intuitive approach to classification by considering the proximity of data points in the feature space. This method is particularly suitable for weak labeling as it leverages the notion of clustering, which is analogous to finding the nearest neighbors for a given data point. By using Grid Search to tune hyperparameters, we aim to identify the optimal configuration that can enhance the performance of the weak labeling model.

from sklearn.neighbors import KNeighborsClassifier

param_grid = {
    'n_neighbors': [3, 5, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 200],
    'weights': ['uniform', 'distance'],
    'metric': ['euclidean', 'manhattan', 'minkowski'],
    'algorithm': ['auto', 'ball_tree', 'kd_tree', 'brute'],
    'leaf_size': [10, 20, 30, 40, 50, 60, 70, 80, 90, 100],
}

grid_search = GridSearchCV(KNeighborsClassifier(),
                           param_grid,
                           n_jobs=-1,
                           cv=5,
                           verbose=3)

grid_search.fit(X_train, y_train)
knn_model = grid_search.best_estimator_

print_evaluation(y_val, knn_model.predict(X_val),
                 'KNeighbors Weak Labeling (Validation Set)')

print_evaluation(y_test, knn_model.predict(X_test),
                 'KNeighbors Weak Labeling (Test Set)')

Fitting 5 folds for each of 3120 candidates, totalling 15600 fits
[CV 5/5] END ..........C=0.001, max_iter=100000;, score=0.825 total time=   0.0s
[CV 4/5] END ............C=0.1, max_iter=100000;, score=0.795 total time=   0.0s
[CV 1/5] END ..............C=3, max_iter=100000;, score=0.875 total time=   0.0s
[CV 1/5] END ............C=100, max_iter=100000;, score=0.845 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 4/5] END ...........C=0.01, max_iter=100000;, score=0.785 total time=   0.0s
[CV 1/5] END ..............C=1, max_iter=100000;, score=0.885 total time=   0.0s
[CV 4/5] END ..............C=3, max_iter=100000;, score=0.835 total time=   0.0s
[CV 2/5] END ............C=100, max_iter=100000;, score=0.865 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END ...........C=0.01, max_iter=100000;, score=0.835 total time=   0.0s
[CV 5/5] END ............C=0.1, max_iter=100000;, score=0.865 total time=   0.0s
[CV 5/5] END ..............C=3, max_iter=100000;, score=0.885 total time=   0.0s
[CV 2/5] END .............C=10, max_iter=100000;, score=0.875 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 2/5] END ...........C=0.01, max_iter=100000;, score=0.805 total time=   0.0s
[CV 2/5] END ..............C=3, max_iter=100000;, score=0.875 total time=   0.0s
[CV 3/5] END ..............C=5, max_iter=100000;, score=0.840 total time=   0.0s
[CV 3/5] END ............C=100, max_iter=100000;, score=0.820 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 3/5] END ...........C=0.01, max_iter=100000;, score=0.820 total time=   0.0s
[CV 4/5] END ..............C=1, max_iter=100000;, score=0.820 total time=   0.0s
[CV 1/5] END .............C=10, max_iter=100000;, score=0.870 total time=   0.0s
[CV 5/5] END ............C=100, max_iter=100000;, score=0.885 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END ..........C=0.001, max_iter=100000;, score=0.810 total time=   0.0s
[CV 2/5] END ..............C=5, max_iter=100000;, score=0.875 total time=   0.0s
[CV 3/5] END .............C=10, max_iter=100000;, score=0.830 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END ...........C=0.01, max_iter=100000;, score=0.810 total time=   0.0s
[CV 3/5] END ..............C=3, max_iter=100000;, score=0.845 total time=   0.0s
[CV 4/5] END ............C=100, max_iter=100000;, score=0.835 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END ..........C=0.001, max_iter=100000;, score=0.780 total time=   0.0s
[CV 3/5] END ............C=0.1, max_iter=100000;, score=0.815 total time=   0.0s
[CV 5/5] END ..............C=1, max_iter=100000;, score=0.895 total time=   0.0s
[CV 4/5] END ..............C=5, max_iter=100000;, score=0.835 total time=   0.0s
[CV 4/5] END .............C=10, max_iter=100000;, score=0.820 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 3/5] END ..........C=0.001, max_iter=100000;, score=0.810 total time=   0.0s
[CV 2/5] END ............C=0.1, max_iter=100000;, score=0.835 total time=   0.0s
[CV 2/5] END ..............C=1, max_iter=100000;, score=0.875 total time=   0.0s
[CV 1/5] END ..............C=5, max_iter=100000;, score=0.875 total time=   0.0s
[CV 5/5] END .............C=10, max_iter=100000;, score=0.900 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 2/5] END ..........C=0.001, max_iter=100000;, score=0.800 total time=   0.0s
[CV 1/5] END ............C=0.1, max_iter=100000;, score=0.840 total time=   0.0s
[CV 3/5] END ..............C=1, max_iter=100000;, score=0.830 total time=   0.0s
[CV 5/5] END ..............C=5, max_iter=100000;, score=0.900 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.3s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.3s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.4s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.3s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.4s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.4s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.4s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.4s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.4s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.4s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.4s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.4s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.3s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.4s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.4s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.4s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.4s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.4s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.4s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.4s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.4s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.4s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.4s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.4s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.4s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.4s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.3s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.4s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.4s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.4s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.4s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.4s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.4s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.4s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.4s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.4s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.4s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.4s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.4s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.4s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.4s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.4s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.3s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.3s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.3s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.3s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.1s[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.3s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s

[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.1s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.3s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.4s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.3s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.3s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.3s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.3s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.3s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.3s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.3s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.3s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.3s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.4s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.3s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.3s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.3s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.3s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.3s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.3s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.3s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.3s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.3s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.3s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.3s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.3s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.3s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.3s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.3s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.3s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s

Classification Report: KNeighbors Weak Labeling (Validation Set)
              precision    recall  f1-score   support

           0       0.84      0.78      0.81       333
           1       0.80      0.85      0.82       333

    accuracy                           0.82       666
   macro avg       0.82      0.82      0.82       666
weighted avg       0.82      0.82      0.82       666


Classification Report: KNeighbors Weak Labeling (Test Set)
              precision    recall  f1-score   support

           0       0.83      0.74      0.78      2500
           1       0.77      0.85      0.80      2500

    accuracy                           0.79      5000
   macro avg       0.80      0.79      0.79      5000
weighted avg       0.80      0.79      0.79      5000

• Class Detection: Higher recall for class 1 (0.85) compared to class 0 (0.78-0.74) indicates the model is more effective at identifying positive instances, beneficial for tasks like fraud detection where identifying positives is crucial. As this is a weak labeling task, the model is expected to be better at detecting positive instances.
• Precision-Recall Trade-off: Slightly higher precision for class 0 suggests the model may misclassify some positive instances as negative, a trade-off that needs careful management based on task requirements.
• Moderate Generalization: Accuracy ranging from 0.82 to 0.79 shows reasonable performance but indicates a slight decline on the test set, suggesting the model could improve in handling unseen data.
• Dimensionality Challenges: The variability in performance metrics could highlight potential issues with high-dimensional data, suggesting techniques like PCA could enhance performance by focusing on key features in a lower-dimensional space.

Approach 2.1 KNeighbors Weak Labeling on PCA reduced embeddings

To address the limitations of the KNeighbors classifier in high-dimensional spaces, we incorporate Principal Component Analysis (PCA) to reduce the dimensionality of the sentence embeddings. This step is justified by the fact that KNeighbors can struggle with high-dimensional data, leading to the curse of dimensionality. PCA helps in capturing the most significant features, thereby improving the efficiency and performance of the KNeighbors classifier in the weak labeling task.

from sklearn.decomposition import PCA

pca = PCA(n_components=8)
X_train_pca = pca.fit_transform(X_train)

grid_search.fit(X_train_pca, y_train)
knn_pca_model = grid_search.best_estimator_
print(f'Best Parameters: {grid_search.best_params_}')

print_evaluation(y_val, knn_pca_model.predict(pca.transform(X_val)),
                 'KNeighbors Weak Labeling (PCA Reduced) (Validation Set)')

print_evaluation(y_test, knn_pca_model.predict(pca.transform(X_test)),
                 'KNeighbors Weak Labeling (PCA Reduced) (Test Set)')

Fitting 5 folds for each of 3120 candidates, totalling 15600 fits
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.3s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.3s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.3s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.3s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.3s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.630 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.690 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.655 total time=   0.3s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.690 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.3s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.700 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.810 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.670 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.735 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.725 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.610 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.800 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.750 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.610 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.735 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.750 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.755 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.800 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.780 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.775 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.800 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.730 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.805 total time=   0.2s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.815 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.720 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.775 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.765 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.725 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.735 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.700 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.670 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.785 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.815 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.825 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.655 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.800 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.710 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.785 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.775 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.755 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.745 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.805 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.765 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.760 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.805 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.750 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.740 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.755 total time=   0.1s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.770 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.2s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.740 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.785 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.2s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.785 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.770 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.830 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.705 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.735 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.700 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.1s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.755 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.740 total time=   0.2s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.800 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.765 total time=   0.1s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.755 total time=   0.1s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.795 total time=   0.2s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.720 total time=   0.1s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.800 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.1s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.830 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.795 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.810 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.800 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.815 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.805 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.780 total time=   0.2s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.790 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.795 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.1s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.1s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.1s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.1s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=auto, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=auto, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s

[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.1s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=ball_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.1s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=70, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=80, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=90, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=kd_tree, leaf_size=100, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=10, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=60, weights=distance;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=20, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=30, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=40, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=40, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=70, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=50, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
Best Parameters: {'algorithm': 'auto', 'leaf_size': 10, 'metric': 'euclidean', 'n_neighbors': 30, 'weights': 'distance'}

Classification Report: KNeighbors Weak Labeling (PCA Reduced) (Validation Set)
              precision    recall  f1-score   support

           0       0.80      0.73      0.76       333
           1       0.75      0.82      0.78       333

    accuracy                           0.77       666
   macro avg       0.78      0.77      0.77       666
weighted avg       0.78      0.77      0.77       666


Classification Report: KNeighbors Weak Labeling (PCA Reduced) (Test Set)
              precision    recall  f1-score   support

           0       0.77      0.70      0.73      2500
           1       0.72      0.79      0.75      2500

    accuracy                           0.74      5000
   macro avg       0.74      0.74      0.74      5000
weighted avg       0.74      0.74      0.74      5000

• Dimensionality Reduction Impact: Applying PCA to reduce dimensionality resulted in lower performance metrics compared to the original KNeighbors approach.
• Class Detection: Recall for class 1 is 0.79, while for class 0 it is 0.70, indicating better detection of positive instances but weaker performance for negative instances.
• Overall Accuracy: The accuracy of 0.74 suggests that while PCA helps in reducing the feature space, it might also lead to loss of important information, affecting the model's performance.
• Balanced Metrics: Precision, recall, and F1-score are all 0.74, indicating that the model performs equally well across different metrics but at a lower level compared to the non-PCA approach.

Approach 3: Random Forest

Random Forest is selected for its robustness and ability to handle complex data through ensemble learning. This approach justifies its use by combining multiple decision trees to improve classification accuracy and prevent overfitting. Random Forests are particularly effective in capturing nonlinear relationships and interactions between features, making them a powerful choice.

from sklearn.ensemble import RandomForestClassifier

gradient_boosting_param_grid = {
    'n_estimators': [100, 500, 1000],
    'max_depth': [3, 5, 7, 9, 11, 13]
}

rf_grid_search = GridSearchCV(RandomForestClassifier(),
                              gradient_boosting_param_grid,
                              n_jobs=-1,
                              cv=5,
                              verbose=3)

rf_grid_search.fit(X_train, y_train)
rf_model = rf_grid_search.best_estimator_
print(f'Best Parameters: {rf_grid_search.best_params_}')

print_evaluation(y_val, rf_model.predict(X_val),
                 'Random Forest (Validation Set)')

print_evaluation(y_test, rf_model.predict(X_test),
                 'Random Forest (Test Set)')

Fitting 5 folds for each of 18 candidates, totalling 90 fits
Best Parameters: {'max_depth': 11, 'n_estimators': 1000}

Classification Report: Random Forest (Validation Set)
              precision    recall  f1-score   support

           0       0.83      0.84      0.84       333
           1       0.84      0.83      0.83       333

    accuracy                           0.83       666
   macro avg       0.83      0.83      0.83       666
weighted avg       0.83      0.83      0.83       666


Classification Report: Random Forest (Test Set)
              precision    recall  f1-score   support

           0       0.84      0.82      0.83      2500
           1       0.82      0.84      0.83      2500

    accuracy                           0.83      5000
   macro avg       0.83      0.83      0.83      5000
weighted avg       0.83      0.83      0.83      5000

• Balanced Performance: Precision, recall, and F1-score are consistently high at 0.83-0.84 for both classes, indicating balanced and accurate classification without favoring either class.
• High Reliability: An accuracy of 0.83 across both validation and test sets suggests that the Random Forest model is reliable and makes correct predictions in a significant majority of cases.
• Good Generalization: The similar performance metrics on both the validation and test sets indicate that the model generalizes well to new, unseen data, which is essential for real-world applications.
• Effective Ensemble Learning: The consistent performance metrics reflect the robustness of Random Forest's ensemble learning approach, which combines multiple decision trees to improve classification accuracy and prevent overfitting.

Approach 4: Neural Network

Neural Networks are chosen for their capability to model complex patterns and relationships in the data. This approach is justified by the neural network's ability to learn from high-dimensional sentence embeddings and possibly capture intricate feature representations.

from sklearn.neural_network import MLPClassifier

mlp_param_grid = {
    'hidden_layer_sizes': [(1024, 512), (512, 128), (256, 64), (128, 32)],
    'max_iter': [10000],
}

mlp_grid_search = GridSearchCV(MLPClassifier(),
                               mlp_param_grid,
                               n_jobs=-1,
                               cv=5,
                               verbose=3)
mlp_grid_search.fit(X_train, y_train)
mlp_model = mlp_grid_search.best_estimator_

plt.plot(mlp_model.loss_curve_)
plt.title('Neural Network Loss Curve')
plt.xlabel('Number of Iterations')
plt.ylabel('Loss')
plt.show()

print(f'Best Parameters: {mlp_grid_search.best_params_}')

print_evaluation(y_val, mlp_model.predict(X_val),
                 'Neural Network (Validation Set)')

print_evaluation(y_test, mlp_model.predict(X_test),
                 'Neural Network (Test Set)')

Fitting 5 folds for each of 4 candidates, totalling 20 fits

Best Parameters: {'hidden_layer_sizes': (512, 128), 'max_iter': 10000}

Classification Report: Neural Network (Validation Set)
              precision    recall  f1-score   support

           0       0.83      0.86      0.84       333
           1       0.85      0.83      0.84       333

    accuracy                           0.84       666
   macro avg       0.84      0.84      0.84       666
weighted avg       0.84      0.84      0.84       666


Classification Report: Neural Network (Test Set)
              precision    recall  f1-score   support

           0       0.85      0.84      0.84      2500
           1       0.84      0.85      0.84      2500

    accuracy                           0.84      5000
   macro avg       0.84      0.84      0.84      5000
weighted avg       0.84      0.84      0.84      5000

• Convergence: The loss curve shows that the neural network converges to a stable loss value, indicating that the model has effectively learned the underlying patterns in the data but may suffer from overfitting looking solely at the loss curve.
• Balanced Performance: Precision, recall, and F1-score are all consistently at 0.84-0.85 for both classes, indicating the neural network's ability to accurately classify both positive and negative instances without bias.
• High Accuracy: An accuracy of 0.84 across both validation and test sets reflects the model's strong ability to make correct predictions, showcasing its reliability for weak labeling tasks.
• Good Generalization: The consistent performance on both the validation and test sets suggests that the neural network generalizes well to unseen data, an essential trait for real-world applications.
• Effective Feature Representation: The balanced and high performance metrics indicate that the neural network is effectively capturing complex patterns and relationships in the data, leveraging its architecture to provide robust predictions.

Approach 5: Support Vector Machine

Support Vector Machines (SVM) are included for their effectiveness in high-dimensional spaces and robustness against overfitting. SVMs are particularly suitable for weak labeling as they can find the optimal hyperplane that maximizes the margin between different classes. This approach is justified by the SVM's strong theoretical foundation and its ability to handle both linear and nonlinear classification tasks through different kernel functions, ensuring versatility.

from sklearn.svm import SVC

svm_param_grid = {
    'C': [0.0001, 0.001, 0.01, 0.1, 1, 3, 5, 10],
    'gamma': [1, 0.1, 0.01, 0.001],
    'kernel': ['rbf', 'linear', 'poly', 'sigmoid']
}

svm_grid_search = GridSearchCV(SVC(),
                               svm_param_grid,
                               n_jobs=-1,
                               cv=5,
                               verbose=3)

svm_grid_search.fit(X_train, y_train)
svm_model = svm_grid_search.best_estimator_
print(f'Best Parameters: {svm_grid_search.best_params_}')

print_evaluation(y_val, svm_model.predict(X_val),
                 'Support Vector Machine (Validation Set)')

print_evaluation(y_test, svm_model.predict(X_test),
                 'Support Vector Machine (Test Set)')

Fitting 5 folds for each of 128 candidates, totalling 640 fits
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.720 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=70, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.750 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=10, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=uniform;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=20, weights=distance;, score=0.775 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.765 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=10, weights=distance;, score=0.755 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=uniform;, score=0.790 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=20, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=minkowski, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.640 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=60, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.635 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=100, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.675 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.755 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=manhattan, n_neighbors=200, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.715 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=30, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=uniform;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.770 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=40, weights=distance;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.720 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=uniform;, score=0.750 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.730 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.675 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=50, weights=distance;, score=0.760 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.725 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=manhattan, n_neighbors=60, weights=distance;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.685 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=60, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.780 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=3, weights=distance;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=uniform;, score=0.785 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=euclidean, n_neighbors=5, weights=distance;, score=0.780 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.690 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.755 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.630 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=70, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=uniform;, score=0.720 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.725 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.670 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=70, metric=minkowski, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=uniform;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.795 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.745 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.700 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=30, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.685 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.665 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=uniform;, score=0.740 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.705 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.800 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.690 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=40, weights=distance;, score=0.765 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.775 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.680 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=uniform;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.790 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=50, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.745 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=80, metric=minkowski, n_neighbors=60, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=90, weights=distance;, score=0.745 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.680 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.750 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.655 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=100, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.695 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.690 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.735 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.660 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=uniform;, score=0.725 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.700 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.715 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.765 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.685 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=euclidean, n_neighbors=200, weights=distance;, score=0.730 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.760 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.695 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.670 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=uniform;, score=0.715 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=90, metric=manhattan, n_neighbors=3, weights=distance;, score=0.710 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.705 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=80, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.665 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.700 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.650 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=uniform;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.675 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.730 total time=   0.0s
[CV 3/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.715 total time=   0.0s
[CV 4/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.645 total time=   0.0s
[CV 5/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=90, weights=distance;, score=0.735 total time=   0.0s
[CV 1/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.660 total time=   0.0s
[CV 2/5] END algorithm=brute, leaf_size=100, metric=manhattan, n_neighbors=100, weights=uniform;, score=0.710 total time=   0.0s
Best Parameters: {'C': 1, 'gamma': 1, 'kernel': 'sigmoid'}

Classification Report: Support Vector Machine (Validation Set)
              precision    recall  f1-score   support

           0       0.86      0.86      0.86       333
           1       0.86      0.86      0.86       333

    accuracy                           0.86       666
   macro avg       0.86      0.86      0.86       666
weighted avg       0.86      0.86      0.86       666


Classification Report: Support Vector Machine (Test Set)
              precision    recall  f1-score   support

           0       0.86      0.85      0.86      2500
           1       0.85      0.87      0.86      2500

    accuracy                           0.86      5000
   macro avg       0.86      0.86      0.86      5000
weighted avg       0.86      0.86      0.86      5000

• High Precision and Recall: Precision and recall are both consistently at 0.86 across both classes, indicating the SVM's effectiveness in correctly identifying both positive and negative instances without bias.
• Consistent F1-Score: An F1-score of 0.86 for both classes shows that the model maintains a balance between precision and recall, ensuring reliable performance.
• High Accuracy: An accuracy of 0.86 on both validation and test sets suggests that the SVM is highly reliable and capable of making correct predictions consistently.
• Good Generalization: The similar performance metrics on both the validation and test sets imply that the SVM generalizes well to unseen data, making it a robust choice for real-world applications.
• Effective Margin Maximization: The strong and balanced performance of the SVM reflects its ability to effectively find the optimal hyperplane that maximizes the margin between classes, ensuring robust classification.

Comparison of All Approaches

Logistic Regression

• Performance: Consistently high precision, recall, and F1-score of roughly 0.86 across both classes on validation and test sets.
• Accuracy: Validation set: 0.86, Test set: 0.86
• Generalization: Excellent, with similar metrics on validation and test sets.
• Key Strength: Simplicity and computational efficiency with robust generalization.

KNeighbors

• Performance: Lower recall for class 0 (0.78/0.74) but higher for class 1 (0.85 on both sets). Precision varies between classes.
• Accuracy: Validation set: 0.82, Test set: 0.79
• Generalization: Moderate, with a slight decline on the test set.
• Key Strength: Effective for detecting class 1 instances; most likely high-dimensional data is the limiting factor.

KNeighbors with PCA

• Performance: Reduced precision and recall compared to standard KNeighbors, with balanced but lower metrics.
• Accuracy: Validation set: 0.77, Test set: 0.74
• Generalization: Weaker compared to other models and especially standard KNeighbors.
• Key Strength: Dimensionality reduction; however, potential loss of important information.

Random Forest

• Performance: Balanced precision, recall, and F1-score of 0.83-0.84 across both classes.
• Accuracy: Validation set: 0.83, Test set: 0.83
• Generalization: Good, with consistent metrics on validation and test sets.
• Key Strength: Robust ensemble learning, capturing complex relationships in the data.

Neural Network

• Performance: Balanced precision, recall, and F1-score of 0.84-0.85 across both classes on both sets.
• Accuracy: Validation set: 0.84, Test set: 0.84
• Generalization: Good, with consistent metrics on validation and test sets.
• Key Strength: Effective feature representation and capturing complex patterns.

Support Vector Machine (SVM)

• Performance: Consistently high precision, recall, and F1-score of 0.86 across both classes.
• Accuracy: Validation set: 0.86, Test set: 0.86
• Generalization: Excellent, with similar metrics on validation and test sets.
• Key Strength: Effective margin maximization, providing robust classification.

Summary

• Best Performers: Logistic Regression and SVM show the highest and most consistent performance metrics, with an accuracy of 0.86 on both the validation and test set, indicating strong generalization and reliability.
• Good Performers: Neural Network and Random Forest also demonstrate high performance and good generalization with slightly lower accuracy in the area around 0.83-0.84.
• Moderate Performer: KNeighbors, both standard and with PCA, show reasonable performance but with lower accuracy and generalization compared to other models. The PCA approach particularly suffers from potential information loss, leading to weaker performance.

Overall all weak labeling models show good performance with high accuracy and balanced metrics, indicating their reliability and effectiveness in classifying the data. To consider are the computational efficiency and generalization capabilities, with Logistic Regression and SVM standing out as the top performers in this regard.

Save Best Models

For the semi-supervised learning phase of the weak labeling, we will save the best weak labeling models. The saved models can be used for inference in the weak_labelling.py script. For an example usage of the weak labeling pipeline, refer to the README.md file.

Although we will not all the models in the final pipeline, we will save them for reference and potential future use and completeness.

MODELS_FOLDER = os.getenv('MODELS_DIR', 'models')
os.makedirs(MODELS_FOLDER, exist_ok=True)


def save_model(model, filename, overwrite=False):
    if os.path.exists(f'{MODELS_FOLDER}/weak_labelling/{filename}.pkl') and not overwrite:
        print(f'{filename} already exists. Skipping...')
        return

    with open(f'{MODELS_FOLDER}/weak_labelling/{filename}.pkl', 'wb') as f:
        pickle.dump(model, f)


save_model(log_reg_model, 'log_reg')
save_model(knn_model, 'knn')
save_model(knn_pca_model, 'knn_pca')
save_model(rf_model, 'rf')
save_model(mlp_model, 'mlp')
save_model(svm_model, 'svm')

log_reg already exists. Skipping...
knn already exists. Skipping...
knn_pca already exists. Skipping...
rf already exists. Skipping...
mlp already exists. Skipping...
svm already exists. Skipping...